Cop-Win Graphs and Robber-Win Graphs
نویسنده
چکیده
Let G be a finite connected graph of order at least two. Two players (a cop and a robber) are allowed to play a game on G according to the following rule: The cop chooses a vertex to stay then the robber chooses a vertex afterwards. After that they move alternately along edges of G, where the robber may opt to stay put when his turn to move comes. The cop wins if he succeeds in putting himself on top of the robber, otherwise, the robber wins. A graph G is said to be a cop-win graph if the cop has a winning strategy on it. Otherwise, G is called a robber-win graph. In this paper we give necessary and sufficient conditions for the join, corona, and lexicographic product of two connected graphs to be cop-win graphs. It is shown that the cartesian product G × H of any connected graphs G and H of orders at least two is a robber-win graph. Mathematics Subject Classification: 05C12
منابع مشابه
Cop and robber games when the robber can hide and ride
In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G = (V,E). The cop captures the robber if both players are on the same vertex at the same moment of time. A graph G is called cop win if the cop always captures the robber after a finite number of steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized the ...
متن کاملEdge contraction and cop-win critical graphs
The problem is to determine the number of ‘cops’ needed to capture a ‘robber’ where the game is played with perfect information, the different sides moving alternately. The cops capture the robber when one of them occupies the same vertex as the robber at any time in the game. A copwin graph is one in which one cop can always capture the robber. A graph is cop-win edge-critical with respect to ...
متن کاملCops and Robbers on String Graphs
The game of cops and robber, introduced by Nowakowski and Winkler in 1983, is played by two players on a graph. One controls k cops and the other a robber. The players alternate and move their pieces to the distance at most one. The cops win if they capture the robber, the robber wins by escaping indefinitely. The cop number of G is the smallest k such that k cops win the game. We extend the re...
متن کاملVariations of the cop and robber game on graphs
We prove new theoretical results about several variations of the cop and robber game on graphs. First, we consider a variation of the cop and robber game which is more symmetric called the cop and killer game. We prove for all c < 1 that almost all random graphs are stalemate for the cop and killer game, where each edge occurs with probability p such that 1 nc ≤ p ≤ 1 − 1 nc . We prove that a g...
متن کاملCop-Win Graphs: Optimal Strategies and Corner Rank
The game of cops and robber is a two-player game, played on a graph, between a cop and a robber. To begin the game, the cop and robber each choose a vertex to occupy, with the cop choosing first. Play then alternates between the cop and the robber, with the cop moving first; on a turn a player may move to an adjacent vertex or stay still. If the cop and robber ever occupy the same vertex, the c...
متن کامل